<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.16"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>LibTools: H:/project/LibTools/src/algorithm/Algorithm.h 文件参考</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">LibTools
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- 制作者 Doxygen 1.8.16 -->
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
  initMenu('',false,false,'search.php','搜索');
});
/* @license-end */</script>
<div id="main-nav"></div>
<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><a class="el" href="dir_fbc178c12bd249518b3c0868875b8083.html">algorithm</a></li>  </ul>
</div>
</div><!-- top -->
<div class="header">
  <div class="summary">
<a href="#func-members">函数</a>  </div>
  <div class="headertitle">
<div class="title">Algorithm.h 文件参考</div>  </div>
</div><!--header-->
<div class="contents">
<div class="textblock"><code>#include &quot;<a class="el" href="tools_8h_source.html">../tools/tools.h</a>&quot;</code><br />
</div>
<p><a href="_algorithm_8h_source.html">浏览源代码.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
函数</h2></td></tr>
<tr class="memitem:a75d98bbb517773f8685c32b64ac89ff3"><td class="memTemplParams" colspan="2">template&lt;class T &gt; </td></tr>
<tr class="memitem:a75d98bbb517773f8685c32b64ac89ff3"><td class="memTemplItemLeft" align="right" valign="top">const <a class="el" href="tools_8h.html#a201ce692c9dca6599e5c12d00167419b">DEF_BEG_LIBTOOLS</a> T &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="_algorithm_8h.html#a75d98bbb517773f8685c32b64ac89ff3">qmin</a> (const T &amp;a, const T &amp;b)</td></tr>
<tr class="memdesc:a75d98bbb517773f8685c32b64ac89ff3"><td class="mdescLeft">&#160;</td><td class="mdescRight">返回两者较小者  <a href="_algorithm_8h.html#a75d98bbb517773f8685c32b64ac89ff3">更多...</a><br /></td></tr>
<tr class="separator:a75d98bbb517773f8685c32b64ac89ff3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9379b0bfedc56fbe48ad3e07b67273ee"><td class="memTemplParams" colspan="2">template&lt;class T &gt; </td></tr>
<tr class="memitem:a9379b0bfedc56fbe48ad3e07b67273ee"><td class="memTemplItemLeft" align="right" valign="top">const T &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="_algorithm_8h.html#a9379b0bfedc56fbe48ad3e07b67273ee">qmax</a> (const T &amp;a, const T &amp;b)</td></tr>
<tr class="memdesc:a9379b0bfedc56fbe48ad3e07b67273ee"><td class="mdescLeft">&#160;</td><td class="mdescRight">返回两者较大者  <a href="_algorithm_8h.html#a9379b0bfedc56fbe48ad3e07b67273ee">更多...</a><br /></td></tr>
<tr class="separator:a9379b0bfedc56fbe48ad3e07b67273ee"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a064388cb374aaa40e69c4020a9f9e0d1"><td class="memTemplParams" colspan="2">template&lt;class _InIt , class _OutIt , class _Pr &gt; </td></tr>
<tr class="memitem:a064388cb374aaa40e69c4020a9f9e0d1"><td class="memTemplItemLeft" align="right" valign="top">_OutIt&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="_algorithm_8h.html#a064388cb374aaa40e69c4020a9f9e0d1">copy_real</a> (_InIt _First, _InIt _Last, _OutIt _Dest, _Pr _Pred)</td></tr>
<tr class="memdesc:a064388cb374aaa40e69c4020a9f9e0d1"><td class="mdescLeft">&#160;</td><td class="mdescRight">只有当条件为真时才拷贝  <a href="_algorithm_8h.html#a064388cb374aaa40e69c4020a9f9e0d1">更多...</a><br /></td></tr>
<tr class="separator:a064388cb374aaa40e69c4020a9f9e0d1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a06f9a9fa653c88f36445cacf0ea7ad8d"><td class="memTemplParams" colspan="2">template&lt;class Value1 , class Value2 &gt; </td></tr>
<tr class="memitem:a06f9a9fa653c88f36445cacf0ea7ad8d"><td class="memTemplItemLeft" align="right" valign="top">size_t&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="_algorithm_8h.html#a06f9a9fa653c88f36445cacf0ea7ad8d">copy_seq</a> (Value1 *v1, size_t s1, const Value2 *v2, size_t s2)</td></tr>
<tr class="memdesc:a06f9a9fa653c88f36445cacf0ea7ad8d"><td class="mdescLeft">&#160;</td><td class="mdescRight">拷贝序列2中的值到序列1中  <a href="_algorithm_8h.html#a06f9a9fa653c88f36445cacf0ea7ad8d">更多...</a><br /></td></tr>
<tr class="separator:a06f9a9fa653c88f36445cacf0ea7ad8d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a05245b92e1ff10aff9383c2047ceaa7e"><td class="memTemplParams" colspan="2">template&lt;class InputIterator , class Size , class OutputIterator &gt; </td></tr>
<tr class="memitem:a05245b92e1ff10aff9383c2047ceaa7e"><td class="memTemplItemLeft" align="right" valign="top">OutputIterator&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="_algorithm_8h.html#a05245b92e1ff10aff9383c2047ceaa7e">copy_n</a> (InputIterator first, Size count, OutputIterator dest)</td></tr>
<tr class="memdesc:a05245b92e1ff10aff9383c2047ceaa7e"><td class="mdescLeft">&#160;</td><td class="mdescRight">拷贝n个数量的内容到dest中  <a href="_algorithm_8h.html#a05245b92e1ff10aff9383c2047ceaa7e">更多...</a><br /></td></tr>
<tr class="separator:a05245b92e1ff10aff9383c2047ceaa7e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac05fc8db35cd265c340f0aedf7128c29"><td class="memTemplParams" colspan="2">template&lt;class Iterator , class Size &gt; </td></tr>
<tr class="memitem:ac05fc8db35cd265c340f0aedf7128c29"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="_find_file_8h.html#a37cc1038758216808d5f75090b093c9a">int</a>&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="_algorithm_8h.html#ac05fc8db35cd265c340f0aedf7128c29">Compare</a> (Iterator first1, Size count1, Iterator first2, Size count2)</td></tr>
<tr class="memdesc:ac05fc8db35cd265c340f0aedf7128c29"><td class="mdescLeft">&#160;</td><td class="mdescRight">比较两个序列  <a href="_algorithm_8h.html#ac05fc8db35cd265c340f0aedf7128c29">更多...</a><br /></td></tr>
<tr class="separator:ac05fc8db35cd265c340f0aedf7128c29"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aedfb2bc1f87c412947f80cedcf310c0d"><td class="memTemplParams" colspan="2">template&lt;class Iterator , class ValueType &gt; </td></tr>
<tr class="memitem:aedfb2bc1f87c412947f80cedcf310c0d"><td class="memTemplItemLeft" align="right" valign="top">size_t&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="_algorithm_8h.html#aedfb2bc1f87c412947f80cedcf310c0d">count_size</a> (Iterator first, Iterator end, const ValueType &amp;EndValue)</td></tr>
<tr class="memdesc:aedfb2bc1f87c412947f80cedcf310c0d"><td class="mdescLeft">&#160;</td><td class="mdescRight">计算一个序列的大小，当遇到结束符、或者到达end位置则停止计算  <a href="_algorithm_8h.html#aedfb2bc1f87c412947f80cedcf310c0d">更多...</a><br /></td></tr>
<tr class="separator:aedfb2bc1f87c412947f80cedcf310c0d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a75d62c31a70bdb3ae9aa621fda9d1a88"><td class="memTemplParams" colspan="2">template&lt;class Iterator , class ValueType &gt; </td></tr>
<tr class="memitem:a75d62c31a70bdb3ae9aa621fda9d1a88"><td class="memTemplItemLeft" align="right" valign="top">size_t&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="_algorithm_8h.html#a75d62c31a70bdb3ae9aa621fda9d1a88">count_size</a> (Iterator first, const ValueType &amp;EndValue)</td></tr>
<tr class="memdesc:a75d62c31a70bdb3ae9aa621fda9d1a88"><td class="mdescLeft">&#160;</td><td class="mdescRight">计算一个序列的大小，当遇到结束符时则停止计算  <a href="_algorithm_8h.html#a75d62c31a70bdb3ae9aa621fda9d1a88">更多...</a><br /></td></tr>
<tr class="separator:a75d62c31a70bdb3ae9aa621fda9d1a88"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab5c29dc40888983dd00677929c5c3a93"><td class="memTemplParams" colspan="2">template&lt;class Iterator , class ValueType &gt; </td></tr>
<tr class="memitem:ab5c29dc40888983dd00677929c5c3a93"><td class="memTemplItemLeft" align="right" valign="top">Iterator&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="_algorithm_8h.html#ab5c29dc40888983dd00677929c5c3a93">find_last_of</a> (Iterator first, Iterator last, ValueType val)</td></tr>
<tr class="memdesc:ab5c29dc40888983dd00677929c5c3a93"><td class="mdescLeft">&#160;</td><td class="mdescRight">逆序查找  <a href="_algorithm_8h.html#ab5c29dc40888983dd00677929c5c3a93">更多...</a><br /></td></tr>
<tr class="separator:ab5c29dc40888983dd00677929c5c3a93"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa47ac809a299b50f2a7056d5b4f0a68b"><td class="memTemplParams" colspan="2">template&lt;class Iterator , class ValueType &gt; </td></tr>
<tr class="memitem:aa47ac809a299b50f2a7056d5b4f0a68b"><td class="memTemplItemLeft" align="right" valign="top">Iterator&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="_algorithm_8h.html#aa47ac809a299b50f2a7056d5b4f0a68b">find_first_not_of</a> (Iterator first, Iterator last, ValueType val)</td></tr>
<tr class="memdesc:aa47ac809a299b50f2a7056d5b4f0a68b"><td class="mdescLeft">&#160;</td><td class="mdescRight">查找第一个不为val的字符所在位置  <a href="_algorithm_8h.html#aa47ac809a299b50f2a7056d5b4f0a68b">更多...</a><br /></td></tr>
<tr class="separator:aa47ac809a299b50f2a7056d5b4f0a68b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9910c2076f304ee770bf2080307ba44f"><td class="memTemplParams" colspan="2">template&lt;class Iterator , class ValueType &gt; </td></tr>
<tr class="memitem:a9910c2076f304ee770bf2080307ba44f"><td class="memTemplItemLeft" align="right" valign="top">Iterator&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="_algorithm_8h.html#a9910c2076f304ee770bf2080307ba44f">find_first_of</a> (Iterator first, Iterator last, ValueType val)</td></tr>
<tr class="memdesc:a9910c2076f304ee770bf2080307ba44f"><td class="mdescLeft">&#160;</td><td class="mdescRight">查找第一个为val的字符所在位置  <a href="_algorithm_8h.html#a9910c2076f304ee770bf2080307ba44f">更多...</a><br /></td></tr>
<tr class="separator:a9910c2076f304ee770bf2080307ba44f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac885ac7602a906c93bde0e7d8b2d9f38"><td class="memTemplParams" colspan="2">template&lt;class Iterator , class ValueType &gt; </td></tr>
<tr class="memitem:ac885ac7602a906c93bde0e7d8b2d9f38"><td class="memTemplItemLeft" align="right" valign="top">Iterator&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="_algorithm_8h.html#ac885ac7602a906c93bde0e7d8b2d9f38">find_last_not_of</a> (Iterator first, Iterator last, ValueType val)</td></tr>
<tr class="memdesc:ac885ac7602a906c93bde0e7d8b2d9f38"><td class="mdescLeft">&#160;</td><td class="mdescRight">逆向查找第一个不为val的字符所在位置  <a href="_algorithm_8h.html#ac885ac7602a906c93bde0e7d8b2d9f38">更多...</a><br /></td></tr>
<tr class="separator:ac885ac7602a906c93bde0e7d8b2d9f38"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa69d6a2300c1f391347658986741d8a8"><td class="memTemplParams" colspan="2">template&lt;class Cont , class Value &gt; </td></tr>
<tr class="memitem:aa69d6a2300c1f391347658986741d8a8"><td class="memTemplItemLeft" align="right" valign="top">Cont::iterator&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="_algorithm_8h.html#aa69d6a2300c1f391347658986741d8a8">seq_erase</a> (Cont &amp;c, const Value &amp;val)</td></tr>
<tr class="memdesc:aa69d6a2300c1f391347658986741d8a8"><td class="mdescLeft">&#160;</td><td class="mdescRight">从序列容器中删除一个元素  <a href="_algorithm_8h.html#aa69d6a2300c1f391347658986741d8a8">更多...</a><br /></td></tr>
<tr class="separator:aa69d6a2300c1f391347658986741d8a8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a3ca46c4f35fb3c7d4ab1485b137e14ff"><td class="memTemplParams" colspan="2">template&lt;class Itea1 , class Itea2 &gt; </td></tr>
<tr class="memitem:a3ca46c4f35fb3c7d4ab1485b137e14ff"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="_algorithm_8h.html#a3ca46c4f35fb3c7d4ab1485b137e14ff">equal</a> (Itea1 f1, Itea1 l1, Itea2 f2, Itea2 l2)</td></tr>
<tr class="memdesc:a3ca46c4f35fb3c7d4ab1485b137e14ff"><td class="mdescLeft">&#160;</td><td class="mdescRight">比较两个序列  <a href="_algorithm_8h.html#a3ca46c4f35fb3c7d4ab1485b137e14ff">更多...</a><br /></td></tr>
<tr class="separator:a3ca46c4f35fb3c7d4ab1485b137e14ff"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<h2 class="groupheader">函数说明</h2>
<a id="ac05fc8db35cd265c340f0aedf7128c29"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac05fc8db35cd265c340f0aedf7128c29">&#9670;&nbsp;</a></span>Compare()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Iterator , class Size &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="_find_file_8h.html#a37cc1038758216808d5f75090b093c9a">int</a> Compare </td>
          <td>(</td>
          <td class="paramtype">Iterator&#160;</td>
          <td class="paramname"><em>first1</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">Size&#160;</td>
          <td class="paramname"><em>count1</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">Iterator&#160;</td>
          <td class="paramname"><em>first2</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">Size&#160;</td>
          <td class="paramname"><em>count2</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>比较两个序列 </p>
<dl class="params"><dt>参数</dt><dd>
  <table class="params">
    <tr><td class="paramname">first1</td><td>序列1的开始 </td></tr>
    <tr><td class="paramname">count1</td><td>序列1的长度 </td></tr>
    <tr><td class="paramname">first2</td><td>序列2的开始 </td></tr>
    <tr><td class="paramname">count2</td><td>序列2的长度 </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>返回</dt><dd>若序列1比序列2大则返回1，等于则返回0，小于则返回-1 </dd></dl>
<dl class="section remark"><dt>备注</dt><dd>可以参考strcmp的用法，其算法与strcmp类似 </dd></dl>

<p class="definition">在文件 <a class="el" href="_algorithm_8h_source.html">Algorithm.h</a> 第 <a class="el" href="_algorithm_8h_source.html#l00093">93</a> 行定义.</p>

</div>
</div>
<a id="a05245b92e1ff10aff9383c2047ceaa7e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a05245b92e1ff10aff9383c2047ceaa7e">&#9670;&nbsp;</a></span>copy_n()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class InputIterator , class Size , class OutputIterator &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">OutputIterator copy_n </td>
          <td>(</td>
          <td class="paramtype">InputIterator&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">Size&#160;</td>
          <td class="paramname"><em>count</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">OutputIterator&#160;</td>
          <td class="paramname"><em>dest</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>拷贝n个数量的内容到dest中 </p>
<dl class="params"><dt>参数</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>源内容的首位值 </td></tr>
    <tr><td class="paramname">count</td><td>需要拷贝的大小 </td></tr>
    <tr><td class="paramname">dest</td><td>接收内容的缓冲区 </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>返回</dt><dd>返回目标缓冲区的首位值 </dd></dl>
<dl class="section remark"><dt>备注</dt><dd>该函数只有在高版本的c++stl中&lt;algorithm&gt;才有故而在这里加入进来 </dd></dl>

<p class="definition">在文件 <a class="el" href="_algorithm_8h_source.html">Algorithm.h</a> 第 <a class="el" href="_algorithm_8h_source.html#l00071">71</a> 行定义.</p>

</div>
</div>
<a id="a064388cb374aaa40e69c4020a9f9e0d1"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a064388cb374aaa40e69c4020a9f9e0d1">&#9670;&nbsp;</a></span>copy_real()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class _InIt , class _OutIt , class _Pr &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">_OutIt copy_real </td>
          <td>(</td>
          <td class="paramtype">_InIt&#160;</td>
          <td class="paramname"><em>_First</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">_InIt&#160;</td>
          <td class="paramname"><em>_Last</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">_OutIt&#160;</td>
          <td class="paramname"><em>_Dest</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">_Pr&#160;</td>
          <td class="paramname"><em>_Pred</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>只有当条件为真时才拷贝 </p>
<dl class="params"><dt>参数</dt><dd>
  <table class="params">
    <tr><td class="paramname">_First</td><td>源开始位置 </td></tr>
    <tr><td class="paramname">_Last</td><td>源结束位置 </td></tr>
    <tr><td class="paramname">_Dest</td><td>目标开始位置 </td></tr>
    <tr><td class="paramname">_Pred</td><td>判断函数 </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>返回</dt><dd>返回目标的末尾位置 </dd></dl>

<p class="definition">在文件 <a class="el" href="_algorithm_8h_source.html">Algorithm.h</a> 第 <a class="el" href="_algorithm_8h_source.html#l00031">31</a> 行定义.</p>

</div>
</div>
<a id="a06f9a9fa653c88f36445cacf0ea7ad8d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a06f9a9fa653c88f36445cacf0ea7ad8d">&#9670;&nbsp;</a></span>copy_seq()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Value1 , class Value2 &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">size_t copy_seq </td>
          <td>(</td>
          <td class="paramtype">Value1 *&#160;</td>
          <td class="paramname"><em>v1</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">size_t&#160;</td>
          <td class="paramname"><em>s1</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const Value2 *&#160;</td>
          <td class="paramname"><em>v2</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">size_t&#160;</td>
          <td class="paramname"><em>s2</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>拷贝序列2中的值到序列1中 </p>
<dl class="params"><dt>参数</dt><dd>
  <table class="params">
    <tr><td class="paramname">v1</td><td>序列1 </td></tr>
    <tr><td class="paramname">s1</td><td>序列1中的容量 </td></tr>
    <tr><td class="paramname">v2</td><td>序列2 </td></tr>
    <tr><td class="paramname">s2</td><td>序列2待拷贝的数量 </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>返回</dt><dd>返回拷贝成功的大小 </dd></dl>

<p class="definition">在文件 <a class="el" href="_algorithm_8h_source.html">Algorithm.h</a> 第 <a class="el" href="_algorithm_8h_source.html#l00053">53</a> 行定义.</p>

</div>
</div>
<a id="a75d62c31a70bdb3ae9aa621fda9d1a88"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a75d62c31a70bdb3ae9aa621fda9d1a88">&#9670;&nbsp;</a></span>count_size() <span class="overload">[1/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Iterator , class ValueType &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">size_t count_size </td>
          <td>(</td>
          <td class="paramtype">Iterator&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const ValueType &amp;&#160;</td>
          <td class="paramname"><em>EndValue</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>计算一个序列的大小，当遇到结束符时则停止计算 </p>
<dl class="params"><dt>参数</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>序列开始位置 </td></tr>
    <tr><td class="paramname">EndValue</td><td>结束符 </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>返回</dt><dd>返回序列大小 </dd></dl>

<p class="definition">在文件 <a class="el" href="_algorithm_8h_source.html">Algorithm.h</a> 第 <a class="el" href="_algorithm_8h_source.html#l00138">138</a> 行定义.</p>

</div>
</div>
<a id="aedfb2bc1f87c412947f80cedcf310c0d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aedfb2bc1f87c412947f80cedcf310c0d">&#9670;&nbsp;</a></span>count_size() <span class="overload">[2/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Iterator , class ValueType &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">size_t count_size </td>
          <td>(</td>
          <td class="paramtype">Iterator&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">Iterator&#160;</td>
          <td class="paramname"><em>end</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const ValueType &amp;&#160;</td>
          <td class="paramname"><em>EndValue</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>计算一个序列的大小，当遇到结束符、或者到达end位置则停止计算 </p>
<dl class="params"><dt>参数</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>序列开始位置 </td></tr>
    <tr><td class="paramname">end</td><td>序列结束位置 </td></tr>
    <tr><td class="paramname">EndValue</td><td>结束符 </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>返回</dt><dd>返回序列大小 </dd></dl>

<p class="definition">在文件 <a class="el" href="_algorithm_8h_source.html">Algorithm.h</a> 第 <a class="el" href="_algorithm_8h_source.html#l00118">118</a> 行定义.</p>

</div>
</div>
<a id="a3ca46c4f35fb3c7d4ab1485b137e14ff"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a3ca46c4f35fb3c7d4ab1485b137e14ff">&#9670;&nbsp;</a></span>equal()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Itea1 , class Itea2 &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">bool equal </td>
          <td>(</td>
          <td class="paramtype">Itea1&#160;</td>
          <td class="paramname"><em>f1</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">Itea1&#160;</td>
          <td class="paramname"><em>l1</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">Itea2&#160;</td>
          <td class="paramname"><em>f2</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">Itea2&#160;</td>
          <td class="paramname"><em>l2</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>比较两个序列 </p>
<dl class="params"><dt>参数</dt><dd>
  <table class="params">
    <tr><td class="paramname">f1</td><td>序列1开始位置 </td></tr>
    <tr><td class="paramname">l1</td><td>序列1结束位置 </td></tr>
    <tr><td class="paramname">f2</td><td>序列2开始位置 </td></tr>
    <tr><td class="paramname">l2</td><td>序列2结束位置 </td></tr>
  </table>
  </dd>
</dl>

<p class="definition">在文件 <a class="el" href="_algorithm_8h_source.html">Algorithm.h</a> 第 <a class="el" href="_algorithm_8h_source.html#l00253">253</a> 行定义.</p>

</div>
</div>
<a id="aa47ac809a299b50f2a7056d5b4f0a68b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa47ac809a299b50f2a7056d5b4f0a68b">&#9670;&nbsp;</a></span>find_first_not_of()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Iterator , class ValueType &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">Iterator find_first_not_of </td>
          <td>(</td>
          <td class="paramtype">Iterator&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">Iterator&#160;</td>
          <td class="paramname"><em>last</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">ValueType&#160;</td>
          <td class="paramname"><em>val</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>查找第一个不为val的字符所在位置 </p>
<dl class="params"><dt>参数</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>序列首 </td></tr>
    <tr><td class="paramname">last</td><td>序列尾 </td></tr>
    <tr><td class="paramname">val</td><td>查找的值 </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>返回</dt><dd>返回序列第一次不为val的位置，若不存在返回last迭代器 </dd></dl>

<p class="definition">在文件 <a class="el" href="_algorithm_8h_source.html">Algorithm.h</a> 第 <a class="el" href="_algorithm_8h_source.html#l00179">179</a> 行定义.</p>

</div>
</div>
<a id="a9910c2076f304ee770bf2080307ba44f"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9910c2076f304ee770bf2080307ba44f">&#9670;&nbsp;</a></span>find_first_of()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Iterator , class ValueType &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">Iterator find_first_of </td>
          <td>(</td>
          <td class="paramtype">Iterator&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">Iterator&#160;</td>
          <td class="paramname"><em>last</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">ValueType&#160;</td>
          <td class="paramname"><em>val</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>查找第一个为val的字符所在位置 </p>
<dl class="params"><dt>参数</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>序列首 </td></tr>
    <tr><td class="paramname">last</td><td>序列尾 </td></tr>
    <tr><td class="paramname">val</td><td>查找的值 </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>返回</dt><dd>返回序列第一次不为val的位置，若不存在返回last迭代器 </dd></dl>

<p class="definition">在文件 <a class="el" href="_algorithm_8h_source.html">Algorithm.h</a> 第 <a class="el" href="_algorithm_8h_source.html#l00197">197</a> 行定义.</p>

</div>
</div>
<a id="ac885ac7602a906c93bde0e7d8b2d9f38"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac885ac7602a906c93bde0e7d8b2d9f38">&#9670;&nbsp;</a></span>find_last_not_of()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Iterator , class ValueType &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">Iterator find_last_not_of </td>
          <td>(</td>
          <td class="paramtype">Iterator&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">Iterator&#160;</td>
          <td class="paramname"><em>last</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">ValueType&#160;</td>
          <td class="paramname"><em>val</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>逆向查找第一个不为val的字符所在位置 </p>
<dl class="params"><dt>参数</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>序列首 </td></tr>
    <tr><td class="paramname">last</td><td>序列尾 </td></tr>
    <tr><td class="paramname">val</td><td>查找的值 </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>返回</dt><dd>返回逆序列第一次不为val的位置，若不存在返回last迭代器 </dd></dl>

<p class="definition">在文件 <a class="el" href="_algorithm_8h_source.html">Algorithm.h</a> 第 <a class="el" href="_algorithm_8h_source.html#l00215">215</a> 行定义.</p>

</div>
</div>
<a id="ab5c29dc40888983dd00677929c5c3a93"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab5c29dc40888983dd00677929c5c3a93">&#9670;&nbsp;</a></span>find_last_of()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Iterator , class ValueType &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">Iterator find_last_of </td>
          <td>(</td>
          <td class="paramtype">Iterator&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">Iterator&#160;</td>
          <td class="paramname"><em>last</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">ValueType&#160;</td>
          <td class="paramname"><em>val</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>逆序查找 </p>
<dl class="params"><dt>参数</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>序列首 </td></tr>
    <tr><td class="paramname">last</td><td>序列尾 </td></tr>
    <tr><td class="paramname">val</td><td>查找的值 </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>返回</dt><dd>返回逆序查找首次出现的位置,失败返回last迭代器位置 </dd></dl>

<p class="definition">在文件 <a class="el" href="_algorithm_8h_source.html">Algorithm.h</a> 第 <a class="el" href="_algorithm_8h_source.html#l00158">158</a> 行定义.</p>

</div>
</div>
<a id="a9379b0bfedc56fbe48ad3e07b67273ee"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9379b0bfedc56fbe48ad3e07b67273ee">&#9670;&nbsp;</a></span>qmax()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">const T&amp; qmax </td>
          <td>(</td>
          <td class="paramtype">const T &amp;&#160;</td>
          <td class="paramname"><em>a</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const T &amp;&#160;</td>
          <td class="paramname"><em>b</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>返回两者较大者 </p>

<p class="definition">在文件 <a class="el" href="_algorithm_8h_source.html">Algorithm.h</a> 第 <a class="el" href="_algorithm_8h_source.html#l00015">15</a> 行定义.</p>

</div>
</div>
<a id="a75d98bbb517773f8685c32b64ac89ff3"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a75d98bbb517773f8685c32b64ac89ff3">&#9670;&nbsp;</a></span>qmin()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">const <a class="el" href="tools_8h.html#a201ce692c9dca6599e5c12d00167419b">DEF_BEG_LIBTOOLS</a> T&amp; qmin </td>
          <td>(</td>
          <td class="paramtype">const T &amp;&#160;</td>
          <td class="paramname"><em>a</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const T &amp;&#160;</td>
          <td class="paramname"><em>b</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>返回两者较小者 </p>

<p class="definition">在文件 <a class="el" href="_algorithm_8h_source.html">Algorithm.h</a> 第 <a class="el" href="_algorithm_8h_source.html#l00009">9</a> 行定义.</p>

</div>
</div>
<a id="aa69d6a2300c1f391347658986741d8a8"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa69d6a2300c1f391347658986741d8a8">&#9670;&nbsp;</a></span>seq_erase()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class Cont , class Value &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">Cont::iterator seq_erase </td>
          <td>(</td>
          <td class="paramtype">Cont &amp;&#160;</td>
          <td class="paramname"><em>c</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const Value &amp;&#160;</td>
          <td class="paramname"><em>val</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>从序列容器中删除一个元素 </p>
<dl class="params"><dt>参数</dt><dd>
  <table class="params">
    <tr><td class="paramname">c</td><td>支持前向访问，和迭代器删除的容器 </td></tr>
    <tr><td class="paramname">val</td><td>待删除的值 </td></tr>
  </table>
  </dd>
</dl>

<p class="definition">在文件 <a class="el" href="_algorithm_8h_source.html">Algorithm.h</a> 第 <a class="el" href="_algorithm_8h_source.html#l00234">234</a> 行定义.</p>

</div>
</div>
</div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
制作者 &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.16
</small></address>
</body>
</html>
